Combining Paraconsistent Logic with Argumentation

نویسندگان

  • Diana Grooters
  • Henry Prakken
چکیده

One tradition in the logical study of argumentation is to allow for arguments that combine strict and defeasible inference rules, and to derive the strict inference rules from a logic at least as strong as classical logic. An unsolved problem in this tradition is how the trivialising effect of the classical Ex Falso principle can be avoided when two arguments that use defeasible rules have contradictory conclusions. The problem is especially hard since any solution should arguably preserve current results on satisfaction of consistency and logical closure properties. One approach to solve the problem is to replace classical logic as the source for strict rules with a weaker, monotonic paraconsistent logic. This paper explores this approach in the context of the ASPIC+ framework for structured argumentation, by instantiating it with a paraconsistent consequence notion of Rescher & Manor (1970). The results are positive: satisfaction of the closure and consistency postu-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Logic Programming to Argumentation and Back

Argumentation has gained popularity in recent years as a knowledge representation formalism to support, in particular, non-monotonic and paraconsistent reasoning. I will trace back the origins of two well-known argumentation frameworks (namely abstact argumentation and assumption-based argumentation) to work on the semantics of logic programming and abductive logic programming in the late eight...

متن کامل

On Argumentation-based Paraconsistent Logics

Argumentation is an alternative approach for reasoning with inconsistent information. Starting from a knowledge base (a set of premises) encoded in a logical language, an argumentation-based logic defines arguments and attacks between them using the consequence operator associated with the language, then uses a semantics for evaluating the arguments. The plausible conclusions to be drawn from t...

متن کامل

An Argumentative Semantics for Paraconsistent Reasoning in Description Logic ALC

It is well known that description logics cannot tolerate the incomplete or inconsistent data. Recently, inconsistency handling in description logics becomes more and more important. In this paper, we present an argumentative semantics for paraconsistent reasoning in inconsistent ontologies. An argumentative framework based on argument trees is provided to model argumentation in description logi...

متن کامل

A Parameterised Hierarchy of Argumentation Semantics for Extended Logic Programming and its Application to the Well-founded Semantics

Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument’s premise) and rebuts (attack to an argument’s conclusion). In this paper, we formulate a variety of notions of attack for extended logic programs from combinations of...

متن کامل

Theory of multiple-valued defeasible argumentation and its applications

This paper provides a new departure from the traditional twovalued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP all...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014